Solving the Reader Collision Problem with a Hierarchical Q-learning Algorithm

نویسندگان

  • Junius K. Ho
  • Sanjay E. Sarma
  • Arthur C. Smith
چکیده

This thesis presents HiQ, a hierarchical, online learning algorithm that finds dynamic solutions to the Reader Collision Problem in RFID systems. When the transmissions from one reader interfere with the operation of another reader, a reader collision occurs. ̊ The objective of the Reader Collision Problem is to minimize the reader collisions experienced by RFID readers while using the minimum number of frequencies and using the minimum total time for all readers to communicate successfully. HiQ attempts to minimize reader collisions by learning the collision patterns of the readers and by effectively assigning ̊frequencies over time to ensure neighboring readers do not experience collisions from one another. HiQ is arranged hierarchically with distributed, local control. ̊ The algorithm is based on a type of reinforcement learning called Qlearning, which is used to determine frequency and time assignments. Through repeated interaction with the system, Q-learning attempts to discover an optimum frequency assignment over time. Thesis Supervisor: Sanjay E. Sarma Title: Associate Professor

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

افزایش سرعت شناسایی در سیستم‌های RFID

Radio frequency identification (RFID) is a new generation of automatic identification systems, based on wireless communication technology. In these systems all the tags using one communication channel to communicate with the reader. When two or more tags transmit their data to the reader simultaneously, their transmitted signals will collide. Resolving this collision has a direct impact on the ...

متن کامل

An integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method

In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...

متن کامل

Solving a New Multi-objective Unrelated Parallel Machines Scheduling Problem by Hybrid Teaching-learning Based Optimization

This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizesthe maximum completion time (i.e., makespan or ), maximum earliness ( ), and maximum tardiness ( ) simultaneously. Jobs have non-identical due dates, sequence-dependent setup times and machine-dependentprocessing times. A multi-objective mixed-integer linear programmi...

متن کامل

Adaptive Aloha anti-collision algorithms for RFID systems

In this paper, we propose two adaptive frame size Aloha algorithms, namely adaptive frame size Aloha 1 (AFSA1) and adaptive frame size Aloha 2 (AFSA2), for solving radio frequency identification (RFID) multiple-tag anti-collision problem. In AFSA1 and AFSA2, the frame size in the next frame is adaptively changed according to the real-time collision rate measured in the current frame. It is show...

متن کامل

Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003